Discrete Random Contention System with Variable Packet Length
نویسندگان
چکیده
The paper researches the random contention system in-depth using the average cycle method, then gets the formulas of the systemic throughput, free rate and collision rate with variable packet length. The simulation results verify the correctness of the theory, meanwhile, gets some conclusions that the different arrival rate G is how to affect the main source of the throughput with variable packet length. It has some researching significance.
منابع مشابه
Asynchronous Optical Packet−switched Networks: a Preliminary Study of Contention−resolution Schemes
The objective of this study is to investigate an asynchronous optical packet−switched network with variable− length packets, and examine (via simulation) the performance tradeoffs of contention resolution in the wavelength, time, and space domains.
متن کاملMake random access contentions transparent by orthogonal complementary codes in wireless communications
Transparent contention means that receivers and/or transmitters know the random access contention before data packet transmissions. With transparent contention, channel access can be scheduled to avoid packet collisions. More important, packet priority and QoS can be conveniently managed. This paper proposes new methods which make contention transparent in random access wireless networks. Packe...
متن کاملDISCRETE-TIME GI/D-MSP/1/K QUEUE WITH N THRESHOLD POLICY
This paper presents a discrete-time single-server finite buffer N threshold policy queue with renewal input and discreteMarkovian service process. The server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is N. We obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary...
متن کاملPerformance Analysis of CDMA Random Access Systems with Heavy-Tailed Packet Length Distribution
This paper analyzes the p e ~ o r m a n c e of unslotted CDMA random access schemes with heavy-tailed packet length distribution. Most of the previous work cover the analysis of the system with Poisson process and for infinite population and infinite buffer size where the results mainly depend on the mean values of the traffic. In this paper we remove these assumptions and analyze the behavior ...
متن کاملFormal Analysis of Memory Contention in a Multiprocessor System
Multi-core processors along with multi-module memories are extensively being used in high performance computers these days. One of the main performance evaluation metrics in such configurations is the memory contention problem and its effect on the overall memory access time. Usually, this problem is analyzed using simulation or numerical methods. However, these methods either cannot guarantee ...
متن کامل